A Gale–Berlekamp permutation-switching problem

A Gale-Berlekamp permutation-switching problem

In the spirit of the light switching game of Gale and Berlekamp, we define a light switching game based on permutations. We consider the game over the integers modulo k, that is, with light bulbs in an n × n formation, having k different intensities cyclically switching from 0 (off) to (k − 1) (highest intensity) and then back to 0 (off). Under permutation switching, that is, adding a permutati...

Modelling a Permutation Problem

Common Permutation Problem

In this paper we show that the following problem is NP -complete: Given an alphabet Σ and two strings over Σ, the question is whether there exists a permutation of Σ which is a subsequence of both of the given strings.

On a Problem concerning Permutation Polynomials

Let S(f) denote the set of integral ideals / such that / is a permutation polynomial modulo i", where / is a polynomial over the ring of integers of an algebraic number field. We obtain a classification for the sets S which may be written in the form S(f). Introduction. A polynomial f(x) with coefficients in a commutative ring R is said to be a permutation polynomial modulo an ideal I oi R (abb...

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...